package bTree.LeetCode;

public class 寻找旋转排序数组中的最小值 {
    public int findMin(int[] nums) {
        int left = 0, right = nums.length - 1;
        while (left<= right){
            int mid=(left+right)/2;
            if (nums[left]<=nums[mid]&&nums[mid]<=nums[right]){
                return nums[left];
            }else if (nums[mid]>=nums[left]){
                left=mid+1;
            }else {
                right=mid;
            }
        }
        return -1;
    }
}